Success of Heuristics and the Solution Space Representation
نویسنده
چکیده
In the study a developed solution for VRP (Vehicle Routing Problem) and its algorithms were analysed in order to find explanations for their success and evaluate their results. Another exciting question at the combinatorial optimization is the solution space which is often referred in the literature despite we do not have tools for its representation, although the distinction of solutions seems to be important at the Evolutionary techniques and at the generalized model of Adaptive Memory Programming.
منابع مشابه
An Improved Tabu Search Algorithm for Job Shop Scheduling Problem Trough Hybrid Solution Representations
Job shop scheduling problem (JSP) is an attractive field for researchers and production managers since it is a famous problem in many industries and a complex problem for researchers. Due to NP-hardness property of this problem, many meta-heuristics are developed to solve it. Solution representation (solution seed) is an important element for any meta-heuristic algorithm. Therefore, many resear...
متن کاملApproximation of fixed points for a continuous representation of nonexpansive mappings in Hilbert spaces
This paper introduces an implicit scheme for a continuous representation of nonexpansive mappings on a closed convex subset of a Hilbert space with respect to a sequence of invariant means defined on an appropriate space of bounded, continuous real valued functions of the semigroup. The main result is to prove the strong convergence of the proposed implicit scheme to the unique solutio...
متن کاملA Note on Solving Prandtl's Integro-Differential Equation
A simple method for solving Prandtl's integro-differential equation is proposed based on a new reproducing kernel space. Using a transformation and modifying the traditional reproducing kernel method, the singular term is removed and the analytical representation of the exact solution is obtained in the form of series in the new reproducing kernel space. Compared with known investigations, its ...
متن کاملEffective heuristics and meta-heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons
Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy 3-opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and pa...
متن کاملdominating subset and representation graph on topological spaces
Let a topological space. An intersection graph on a topological space , which denoted by , is an undirected graph which whose vertices are open subsets of and two vertices are adjacent if the intersection of them are nonempty. In this paper, the relation between topological properties of and graph properties of are investigated. Also some classifications and representations for the graph ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006